Least-Squares Joint Diagonalization of a matrix set by a congruence transformation
نویسندگان
چکیده
The approximate joint diagonalization (AJD) is an important analytic tool at the base of numerous independent component analysis (ICA) and other blind source separation (BSS) methods, thus finding more and more applications in medical imaging analysis. In this work we present a new AJD algorithm named SDIAG (Spheric Diagonalization). It imposes no constraint either on the input matrices or on the joint diagonalizer to be estimated, thus it is very general. Whereas it is well grounded on the classical leastsquares criterion, a new normalization reveals a very simple form of the solution matrix. Numerical simulations shown that the algorithm, named SDIAG (spheric diagonalization), behaves well as compared to state-of-the art AJD algorithms.
منابع مشابه
A novel joint diagonalization approach for linear stochastic systems and reliability analysis
Purpose – The purpose of this paper is to present a novel gradient-based iterative algorithm for the joint diagonalization of a set of real symmetric matrices. The approximate joint diagonalization of a set of matrices is an important tool for solving stochastic linear equations. As an application, reliability analysis of structures by using the stochastic finite element analysis based on the j...
متن کاملNon-orthogonal joint diagonalization in the least-squares sense with application in blind source separation
Approximate joint diagonalization of a set of matrices is an essential tool in many blind source separation (BSS) algorithms. A common measure of the attained diagonalization of the set is the weighted least-squares (WLS) criterion. However, most well-known algorithms are restricted to finding an orthogonal diagonalizing matrix, relying on a whitening phase for the nonorthogonal factor. Often, ...
متن کاملExtension of the “Sequentially Drilled” Joint Congruence Transformation (SeDJoCo) Problem
The Sequentially Drilled Joint Congruence (SeDJoCo) transformation has been identified as an important tool in the context of both Blind Source Separation (BSS) and closed-form Coordinated Beamforming (CBF) for the multi-user MIMO downlink. It can be interpreted as a new tensor decomposition. In this contribution, we introduce an extension of the SeDJoCo problem and address its links to the fie...
متن کاملLeast Square Joint Diagonalization of Matrices under an Intrinsic Scale Constraint
We present a new algorithm for approximate joint diagonalization of several symmetric matrices. While it is based on the classical least squares criterion, a novel intrinsic scale constraint leads to a simple and easily parallelizable algorithm, called LSDIC (Least squares Diagonalization under an Intrinsic Constraint). Numerical simulations show that the algorithm behaves well as compared to o...
متن کاملA Linear Least-squares Algorithm for Joint Diagonalization
We present a new approach to approximate joint diagonalization of a set of matrices. The main advantages of our method are computational efficiency and generality. We develop an iterative procedure, called LSDIAG, which is based on multiplicative updates and on linear least-squares optimization. The efficiency of our algorithm is achieved by the first-order approximation of the matrices being d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009